Playful Boolean algebras

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Playful Boolean Algebras

We show that for an atomless complete Boolean algebra 8 of density < 2N°, the Banach-Mazur, the split and choose, and the Ulam game on S are equivalent. Moreover, one of the players has a winning strategy just in trivial cases: Empty wins iff B adds a real; Nonempty wins iff B has a (r-closed dense set. This extends some previous results of Foreman, Jech, and Vojtáá. 0. Introduction. In [Jel an...

متن کامل

Robbins Algebras vs. Boolean Algebras

In the early 1930s, Huntington proposed several axiom systems for Boolean algebras. Robbins slightly changed one of them and asked if the resulted system is still a basis for variety of Boolean algebras. The solution (afirmative answer) was given in 1996 by McCune with the help of automated theorem prover EQP/OTTER. Some simplified and restucturized versions of this proof are known. In our vers...

متن کامل

Boolean Algebras in Visser Algebras

We generalize the double negation construction of Boolean algebras in Heyting algebras, to a double negation construction of the same in Visser algebras (also known as basic algebras). This result allows us to generalize Glivenko’s Theorem from intuitionistic propositional logic and Heyting algebras to Visser’s basic propositional logic and Visser algebras. Mathematics Subject Classification: P...

متن کامل

Imaginaries in Boolean algebras

Given an infinite Boolean algebra B, we find a natural class of ∅-definable equivalence relations EB such that every imaginary element from B is interdefinable with an element from a sort determined by some equivalence relation from EB . It follows that B together with the family of sorts determined by EB admits elimination of imaginaries in a suitable multisorted language. The paper generalize...

متن کامل

Boolean like algebras

Boolean algebras have an exceptionally rich and smooth structure theory, of which Stone’s representation theorem is a prominent example. What is so special about Boolean algebras that is responsible for this nice behaviour? Given a similarity type ν, can we always find a class of algebras of type ν that displays Boolean-like features? And what does it mean, for an algebra of a given type ν that...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Transactions of the American Mathematical Society

سال: 1986

ISSN: 0002-9947

DOI: 10.1090/s0002-9947-1986-0846604-0